Open Problems in Discrete and Computational Geometry
نویسندگان
چکیده
H. Edelsbrunner1, A. Ivanov2 and R. Karasev3 Institute of Science and Technology Austria, Yaroslavl State University Moscow State University, Yaroslavl State University Moscow Institute of Physics and Technology, Yaroslavl State University e-mail: [email protected], [email protected], [email protected] получена 22 ноября 2006 Ключевые слова: Discrete and Computational Geometry, Computational Topology, Open Problems
منابع مشابه
Local and Global Approaches to Fracture Mechanics Using Isogeometric Analysis Method
The present research investigates the implementations of different computational geometry technologies in isogeometric analysis framework for computational fracture mechanics. NURBS and T-splines are two different computational geometry technologies which are studied in this work. Among the features of B-spline basis functions, the possibility of enhancing a B-spline basis with discontinuities ...
متن کاملA Discrete Singular Convolution Method for the Seepage Analysis in Porous Media with Irregular Geometry
A novel discrete singular convolution (DSC) formulation is presented for the seepage analysis in irregular geometric porous media. The DSC is a new promising numerical approach which has been recently applied to solve several engineering problems. For a medium with regular geometry, realizing of the DSC for the seepage analysis is straight forward. But DSC implementation for a medium with ir...
متن کاملThe Utility of Untangling
In this note we show how techniques developed for untangling planar graphs by Bose et al.[Discrete & Computational Geometry 42(4): 570-585 (2009)] and Goaoc et al.[Discrete & Computational Geometry 42(4): 542-569 (2009)] imply new results about some recent graph drawing models. These include column planarity, universal point subsets, and partial simultaneous geometric embeddings (with or withou...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012